The Comparison of Bondage Number and Domination Number with Minimum and Maximum Degrees of an Interval Graph G Using an Algorithm
نویسندگان
چکیده
منابع مشابه
DOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملan investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols
this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...
Domination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کاملan investigation about the relationship between insurance lines and economic growth; the case study of iran
مطالعات قبلی بازار بیمه را به صورت کلی در نظر می گرفتند اما در این مطالعه صنعت بیمه به عنوان متغیر مستفل به بیمه های زندگی و غیر زندگی شکسته شده و هم چنین بیمه های زندگی به رشته های مختلف بیمه ای که در بازار بیمه ایران سهم قابل توجهی دارند تقسیم میشود. با استفاده از روشهای اقتصاد سنجی داده های برای دوره های 48-89 از مراکز ملی داده جمع آوری شد سپس با تخمین مدل خود بازگشتی برداری همراه با تعدادی ...
15 صفحه اولThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2017
ISSN: 2321-9653
DOI: 10.22214/ijraset.2017.11127